How Multiserver Queues Scale with Growing Congestion-Dependent Demand
نویسنده
چکیده
منابع مشابه
The Lagged PSA for Estimating Peak Congestion in Multiserver Markovian Queues with Periodic Arrival Rates
W A 7 e propose using a modification of the simple peak hour approximation (SPHA) for estimating peak congestion in multiserver queueing systems with exponential service times and time-varying periodic Poisson arrivals. This lagged pointwise stationary approximation (lagged PSA) is obtained by first estimating the time of the actual peak congestion by the time of peak congestion in an infinite ...
متن کاملQ Q Ueuing Ueuing a Analysis Nalysis
WHY QUEUING ANALYSIS? ......................................................................................2 QUEUING MODELS......................................................................................................3 The Single-Server Queue.....................................................................................3 Queue Parameters .............................................
متن کاملA tractable analytical model for large-scale congested protein synthesis networks
This paper presents an analytical model, based on finite capacity queueing network theory, to evaluate congestion in protein synthesis networks. These networks are modeled as a set of single server bufferless queues in a tandem topology. This model proposes a detailed state space formulation, which provides a fine description of congestion and contributes to a better understanding of how the pr...
متن کاملAccess control of parallel multiserver loss queues
This paper considers access control in a target multiserver loss queue fed by a set of upstream parallel multiserver loss queues and by a stream of new customers. The target queue faces a choice of how many servers to reserve for each stream. Revenue is gained by each station when it serves a customer, but the amount of revenue at the target queue depends on the source of the customer. We prove...
متن کاملFurther delay moment results for FIFO multiserver queues
Using a new family of service disciplines, we provide weaker su cient conditions for nite stationary delay moments in FIFO multiserver queues. This extends the work in Sigman and Scheller-Wolf[1997] to GI=GI=s queues with = E[S]=E[T ] < s 1, where S and T are generic service and interarrival times, respectively. Thus, only when > s 1 are the familiar Kie er and Wolfowitz conditions actually nec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Operations Research
دوره 51 شماره
صفحات -
تاریخ انتشار 2003